منابع مشابه
Fair Simulation
The simulation preorder for labeled transition systems is defined locally as a game that relates states with their immediate successor states. Simulation enjoys many appealing properties. First, simulation has a fully abstract semantics: system S simulates system I iff every computation tree embedded in the unrolling of I can be embedded also in the unrolling of S. Second, simulation has a logi...
متن کاملApplicability of Fair Simulation
In this paper we compare four notions of fair simulation direct delay game and exists Our comparison refers to three main aspects The time complexity of constructing the fair simulation the ability to use it for minimization and the relationship between the fair simulations and universal branching time logics We developed two practical applications that are based on this com parison The rst is ...
متن کاملFair Simulation Minimization
We present an algorithm for the minimization of Büchi automata based on the notion of fair simulation introduced in [6]. Unlike direct simulation, fair simulation allows flexibility in the satisfaction of the acceptance conditions, and hence leads to larger relations. However, it is not always possible to remove edges to simulated states or merge simulation-equivalent states without altering th...
متن کاملQuantitative Fair Simulation Gamest
Simulation is an attractive alternative for language inclusion for automata as it is an under-approximation of language inclusion, but usually has much lower complexity. For non-deterministic automata, while language inclusion is PSPACE-complete, simulation can be computed in polynomial time. Simulation has also been extended in two orthogonal directions, namely, (1) fair simulation, for simula...
متن کاملMinimization of Büchi Automata using Fair Simulation
We present an algorithm, which reduces the size of Büchi automata using fair simulation. Its time complexity is O(|Q|4 · |∆|2), the space complexity is O(|Q| · |∆|). Simulation is a common approach for minimizing ω-automata such as Büchi automata. Direct simulation, delayed simulation and fair simulation are different types of simulation. As we will show, minimization based on direct or delayed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2002
ISSN: 0890-5401
DOI: 10.1006/inco.2001.3085